Using interval arithmetic to prove that a set is path-connected
نویسندگان
چکیده
منابع مشابه
Using interval arithmetic to prove that a set is path-connected
In this paper, we give a numerical algorithm able to prove whether a set S described by nonlinear inequalities is path-connected or not. To our knowledge, no other algorithm (numerical or symbolic) is able to deal with this type of problem. The proposed approach uses interval arithmetic to build a graph which has exactly the same number of connected components than S. Examples illustrate the pr...
متن کاملHow to Prove That a Committed Number Is Prime
The problem of proving a number is of a given arithmetic format with some prime elements, is raised in RSA undeniable signature, group signature and many other cryptographic protocols. So far, there have been several studies in literature on this topic. However, except the scheme of Camenisch and Michels, other works are only limited to some special forms of arithmetic format with prime element...
متن کاملSpaces That Are Connected but Not Path-connected
A topological space X is called connected if it’s impossible to write X as a union of two nonempty disjoint open subsets: if X = U ∪ V where U and V are open subsets of X and U ∩ V = ∅ then one of U or V is empty. Intuitively, this means X consists of one piece. A subset of a topological space is called connected if it is connected in the subspace topology. The most fundamental example of a con...
متن کاملInterval Arithmetic Using SSE-2
We present an implementation of double precision interval arithmetic using the single-instruction-multiple-data SSE-2 instruction and register set extensions. The implementation is part of a package for exact real arithmetic, which defines the interval arithmetic variation that must be used: incorrect operations such as division by zero cause exceptions and loose evaluation of the operations is...
متن کاملFrom Interval Arithmetic to Interval Constraints
Two definitions of division by an interval containing zero are compared: a functional one and a relational one. We show that the relational definition also provides interval inverses for other functions that do not have point inverses, such as max and the absolute-value function. Applying the same approach to the ≤ relation introduces the “companion functions” of relations. By regarding the ari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.09.055